On the Moore-Penrose inverse in solving saddle-point systems with singular diagonal blocks

نویسندگان

  • Radek Kucera
  • Tomás Kozubek
  • Alexandros Markopoulos
  • Jitka Machalová
چکیده

The paper deals with the role of the generalized inverses in solving saddle-point systems arising naturally in the solution of many scientific and engineering problems when FETI based domain decomposition methods are used to their numerical solution. It is shown that the Moore-Penrose inverse may be obtained in this case at negligible cost by projecting an arbitrary generalized inverse using orthogonal projectors. Applying an eigenvalue analysis based on the Moore-Penrose inverse, it is proved for simple model problems that the number of conjugate gradient iterations required for the solution of associate dual systems does not depend on discretization norms. The theoretical results are confirmed by numerical experiments with linear elasticity problems. Copyright c © 2011 John Wiley & Sons, Ltd.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

General constraint preconditioning iteration method for singular saddle-point problems

For the singular saddle-point problems with nonsymmetric positive definite (1, 1) block, we present a general constraint preconditioning (GCP) iteration method based on a singular constraint preconditioner. Using the properties of the Moore-Penrose inverse, the convergence properties of the GCP iteration method are studied. In particular, for each of the two different choices of the (1, 1) bloc...

متن کامل

An Efficient Schulz-type Method to Compute the Moore-Penrose Inverse

A new Schulz-type method to compute the Moore-Penrose inverse of a matrix is proposed. Every iteration of the method involves four matrix multiplications. It is proved that this method converge with fourth-order. A wide set of numerical comparisons shows that the average number of matrix multiplications and the average CPU time of our method are considerably less than those of other methods.

متن کامل

Group inverses of matrices with path graphs

A simple formula for the group inverse of a 2× 2 block matrix with a bipartite digraph is given in terms of the block matrices. This formula is used to give a graph-theoretic description of the group inverse of an irreducible tridiagonal matrix of odd order with zero diagonal (which is singular). Relations between the zero/nonzero structures of the group inverse and the Moore-Penrose inverse of...

متن کامل

On the duality of quadratic minimization problems using pseudo inverses

‎In this paper we consider the minimization of a positive semidefinite quadratic form‎, ‎having a singular corresponding matrix $H$‎. ‎We state the dual formulation of the original problem and treat both problems only using the vectors $x in mathcal{N}(H)^perp$ instead of the classical approach of convex optimization techniques such as the null space method‎. ‎Given this approach and based on t...

متن کامل

A generalization of the Moore-Penrose inverse related to matrix subspaces of Cn×m

A natural generalization of the classical Moore-Penrose inverse is presented. The so-called S-Moore-Penrose inverse of a m × n complex matrix A, denoted by AS, is defined for any linear subspace S of the matrix vector space Cn×m. The S-Moore-Penrose inverse AS is characterized using either the singular value decomposition or (for the nonsingular square case) the orthogonal complements with resp...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Numerical Lin. Alg. with Applic.

دوره 19  شماره 

صفحات  -

تاریخ انتشار 2012